Sciweavers

820 search results - page 94 / 164
» Finding low-utility data structures
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 9 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
HICSS
2008
IEEE
113views Biometrics» more  HICSS 2008»
14 years 3 months ago
A Cross-Cultural Comparison of Perceived Strategic Importance of RFID for CIOs in Germany and Italy
Purpose: Drawing from literature on innovation, strategy and culture the objective of this study is to explore the role of perceived potentials and perceived strategic importance ...
Stefanie Jahner, Jan Marco Leimeister, Uta Franzis...
WWW
2010
ACM
14 years 1 months ago
Web-scale knowledge extraction from semi-structured tables
A wealth of knowledge is encoded in the form of tables on the World Wide Web. We propose a classification algorithm and a rich feature set for automatically recognizing layout tab...
Eric Crestan, Patrick Pantel
HIPC
2007
Springer
14 years 22 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
14 years 18 days ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot