Sciweavers

1376 search results - page 97 / 276
» Searching Trees: An Essay
Sort
View
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ICDE
2009
IEEE
245views Database» more  ICDE 2009»
16 years 8 months ago
WISE: A Workflow Information Search Engine
Workflows are widely used for representing business processes, web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for peo...
Qihong Shao, Peng Sun, Yi Chen
ICML
2005
IEEE
16 years 7 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ASP
2005
Springer
15 years 12 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 7 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick