Sciweavers

11211 search results - page 1 / 2243
» Rank-Sensitive Data Structures
Sort
View
74
Voted
SPIRE
2005
Springer
15 years 4 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
FECS
2009
172views Education» more  FECS 2009»
14 years 8 months ago
Using Interface Inheritance to Structure the Data Structures Course
Traditional instruction in the first data structures course treats object-oriented inheritance and polymorphism as isolated topics if at all. Course organization is an exploration...
Dale Parson, Daniel Spiegel
PVLDB
2008
122views more  PVLDB 2008»
14 years 10 months ago
Structural signatures for tree data structures
Ashish Kundu, Elisa Bertino
SIGMOD
2011
ACM
455views Database» more  SIGMOD 2011»
14 years 1 months ago
DBWiki: a structured wiki for curated data and collaborative data management
Wikis have proved enormously successful as a means to collaborate in the creation and publication of textual information. At the same time, a large number of curated databases hav...
Peter Buneman, James Cheney, Sam Lindley, Heiko M&...