Sciweavers

578 search results - page 96 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 9 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ESWS
2007
Springer
14 years 1 months ago
Developing Ontologies for Collaborative Engineering in Mechatronics
Abstract. Creating a coherent set of ontologies to support a collaborative design process amongst different firms which develop mechatronic products is a challenge due to the seman...
Violeta Damjanovic, Wernher Behrendt, Manuela Pl&o...
SOFSEM
2007
Springer
14 years 1 months ago
Creating Permanent Test Collections of Web Pages for Information Extraction Research
In the research area of automatic web information extraction, there is a need for permanent and annotated web page collections enabling objective performance evaluation of differen...
Bernhard Pollak, Wolfgang Gatterbauer
WEBDB
2007
Springer
128views Database» more  WEBDB 2007»
14 years 1 months ago
Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Na...
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 1 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...