Sciweavers

422 search results - page 36 / 85
» Generalizations of small profinite structures
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICFP
2006
ACM
14 years 8 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons
SIGIR
2005
ACM
14 years 2 months ago
Indexing emails and email threads for retrieval
Electronic mail poses a number of unusual challenges for the design of information retrieval systems and test collections, including informal expression, conversational structure,...
Yejun Wu, Douglas W. Oard
DAC
2002
ACM
14 years 9 months ago
Guaranteed passive balancing transformations for model order reduction
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the mod...
Joel R. Phillips, Luca Daniel, Luis Miguel Silveir...
WWW
2007
ACM
14 years 9 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui