Lora Aroyo - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged search

An improvement on floating search algorithms for feature subset selectionSongyot Nakariyakul, David Casasent. PR, 42(9):1932-1940, 2009. [doi]

Semantic annotation and search of cultural-heritage collections: The MultimediaN E-Culture demonstratorGuus Schreiber, Alia K. Amin, Lora Aroyo, Mark van Assem, Viktor de Boer, Lynda Hardman, Michiel Hildebrand, Borys Omelayenko, Jacco van Ossenbruggen, Anna Tordai, Jan Wielemaker, Bob J. Wielinga. ws, 6(4):243-249, 2008. [doi]

Navigational behaviour and sponsored search advertisingNico Brooks, Harrison Magun. ijeb, 6(2):132-148, 2008. [doi]

Identifying clusters of user behavior in intranet search engine log filesDick Stenmark. jasis, 59(14):2232-2243, 2008. [doi]

Semantic Search - A new way to searchIn SWWS. 2008: 26-29

Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson ApproximationsMichael Fuchs. cpc, 17(5):661-680, 2008. [doi]

On Dynamic Breadth-First Search in External-MemoryUlrich Meyer. STACS 2008: 551-560 [doi]

DERI at TREC 2008 Enterprise Search TrackRonan Cummins, Colm O Riordan. trec 2008: [doi]

Quality search content: A reality with next generation browsersSadasivuni Lakshminarayana. jasis, 58(8):1223, 2007. [doi]

Best practices and future visions for search user interfacesMarc L. Resnick, Misha W. Vaughan. jasis, 57(6):781-787, 2006. [doi]

Acceleration of Covariance Models for Non-coding RNA SearchScott F. Smith 0002. psb 2006: 148-153

Danish and Greek Web Search Experiments with Hummingbird SearchServer:::TM::: at CLEF 2005Stephen Tomlinson. clef 2006: 846-855 [doi]

Clause Weighting Local Search for SATJohn Thornton. JAR, 35(1-3):97-142, 2005. [doi]

A Tabu Search Algorithm for Post-processing Multiple Sequence AlignmentTariq Riaz, Wang Yi 0003, Kuo-Bin Li. jbcb, 3(1):145-156, 2005. [doi]

Video search: opportunities & challengesRamesh Sarukkai. mir 2005: 2 [doi]

A Dynamic Restart Strategy for Randomized BT SearchVenkata Praveen Guddeti. cp 2004: 796 [doi]

Dynamic Ranking with N + 1 Dimensional Vector Space Models: an Alternative Search Mechanism for World Wide WebS. Lakshminarayan. jasis, 54(3):274-275, 2003. [doi]

The Future of Web SearchB. Croft. acsc 2002:

The ultimate strategy to search on m rays?Alejandro López-Ortiz, Sven Schuierer. TCS, 261(2):267-295, 2001. [doi]

Visual search and mouse-pointing in labeled versus unlabeled two-dimensional visual hierarchiesAnthony J. Hornof. TOCHI, 8(3):171-197, 2001. [doi]

Local First Search - A New Paradigm for Partial Order ReductionsPeter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez. concur 2001: 396-410 [doi]

Fast string matching for multiple searchesPeter M. Fenwick. SPE, 31(9):815-833, 2001.

Improving the parallelized Pollard lambda search on anomalous binary curvesRobert P. Gallant, Robert J. Lambert, Scott A. Vanstone. moc, 69(232):1699-1705, 2000.

GeoViser - Geographic Visualization of Search Engine ResultsJayesh Govindarajan, Matthew O. Ward. dexaw 1999: 269-273 [doi]

Searches On A Binary Tree With Random Edge-WeightsAlan Stacey. cpc, 8(6):555-565, 1999.

The Ultimate Strategy to Search on m Rays?Alejandro López-Ortiz, Sven Schuierer. cocoon 1998: 75-84 [doi]

The Greedy Search Algorithm on Binary VectorsAvner Dor. jal, 27(1):42-60, 1998.

A local search templateRob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra. cor, 25(11):969-979, 1998. [doi]

Using Genetic Algorithms with Local Search for Thin Film MetrologyMark Land, John J. SIDorowich, Richard K. Belew. icga 1997: 537-544

New Local Search Approximation Techniques for Maximum Generalized Satisfiability ProblemsPaola Alimonti. ipl, 57(3):151-158, 1996. [doi]

Combining Binary Search and Newton s Method to Compute Real Roots for a Class of Real FunctionsYinyu Ye. jc, 10(3):271-280, 1994. [doi]

Time-Efficient State Space SearchAlexander Reinefeld, Peter Ridinger. ai, 71(2):397-408, 1994.

Integration of Text Search with ORIONWan-Lik Lee, Darrell Woelk. DEBU, 13(1):56-62, 1990. [doi]

Optimal search algorithm for extrema of a discrete periodic bimodal functionBoris S. Veroy. jc, 5(2):238-250, 1989. [doi]

An Extrapolation on the Interpolation SearchSvante Carlsson, Christer Mattsson. swat 1988: 24-33

A new distributed algorithm to find breadth first search treesBaruch Awerbuch, Robert G. Gallager. TIT, 33(3):315-322, 1987.

The Average Complexity of Depth-First Search with Backtracking and CutoffHarold S. Stone, Paolo Sipala. ibmrd, 30(3):242-258, 1986.

A Decision-Feedback Tree-Search Algorithm for Digital Communication Through Channels with Intersymbol InterferenceJohn G. Proakis, A. Khazen-Terezia. icc 1986: 657-661

An optimal algorithm for search of extrema of a bimodal functionBoris S. Veroy. jc, 2(4):323-332, 1986. [doi]

Search for Sequences with Zero AutocorrelationRoger Alexis. coding 1988: 159-172

On Search by Address ComputationMarkku Tamminen. bit, 25(1):135-147, 1985.

The Origin of the Binary-Search ParadigmZohar Manna, Richard J. Waldinger. IJCAI 1985: 222-224

Algorithmic Search in Management Decision SystemsLaurence A. Madeo, Thomas J. Schriber. ijmms, 13(4):423-435, 1980.

Surveyor s Forum: Determining a SearchWalter G. Wilson. ACM Comput. Surv., 12(3):357-358, 1980.

Substructure Search with Queries of Varying SpecificityAlfred Feldman, Louis Hodes. jcisd, 19(3):125-129, 1979. [doi]

Depth-First Search as a Combinatorial CorrespondenceIra M. Gessel, Da-Lun Wang. JCT, 26(3):308-313, 1979.

Fragment Search in Acyclic StructuresMilan Randic. jcisd, 18(2):101-107, 1978. [doi]

The LOCUS Model of Search and its Use in Image InterpretationSteven M. Rubin, Raj Reddy. IJCAI 1977: 590-595

Heuristic SearchDonald Michie. cj, 14(1):96-102, 1971.

Semantic Road Maps for Literature SearchersLauren B. Doyle. JACM, 8(4):553-578, 1961. [doi]

runs on WebDSL