Sciweavers

2104 search results - page 20 / 421
» Sorting with networks of data structures
Sort
View
AAAI
2006
13 years 8 months ago
Phoebus: A System for Extracting and Integrating Data from Unstructured and Ungrammatical Sources
With the proliferation of online classifieds and auctions comes a new need to meaningfully search and organize the items for sale. However, since the seller's item descriptio...
Matthew Michelson, Craig A. Knoblock
HICSS
2006
IEEE
133views Biometrics» more  HICSS 2006»
14 years 1 months ago
Being Literate with Large Document Collections: Observational Studies and Cost Structure Tradeoffs
How do people work with large document collections? We studied the effects of different kinds of analysis tools on the behavior of people doing rapid large-volume data assessment,...
Daniel M. Russell, Malcolm Slaney, Yan Qu, Mave Ho...
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
14 years 27 days ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
14 years 23 days ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
MST
2006
97views more  MST 2006»
13 years 7 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi