Sciweavers

505 search results - page 100 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
IADIS
2004
13 years 7 months ago
Solving Crossword Puzzles via the Google API
The GoogleTM API enables software agents to query and use search results from the large collections of data available via the ever-popular Google search engine. Web searches using...
David E. Goldschmidt, Mukkai S. Krishnamoorthy
INTERNET
2008
175views more  INTERNET 2008»
13 years 6 months ago
Mashing Up Search Services
through suitable abstractions and tools is a viable option for improving servicebased computations. T he past few years have witnessed end users' increasing involve ment in th...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 10 months 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
TCS
1998
13 years 6 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...