Sciweavers

7315 search results - page 1225 / 1463
» Peer-to-Peer Information Search
Sort
View
FOCS
2000
IEEE
14 years 21 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ICDE
2010
IEEE
203views Database» more  ICDE 2010»
14 years 18 days ago
Optimizing ETL workflows for fault-tolerance
Extract-Transform-Load (ETL) processes play an important role in data warehousing. Typically, design work on ETL has focused on performance as the sole metric to make sure that the...
Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal, M...
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 12 days ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 9 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ACCV
2009
Springer
14 years 9 days ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara
« Prev « First page 1225 / 1463 Last » Next »