Sciweavers

1286 search results - page 166 / 258
» A General Framework for Searching in Distributed Data Reposi...
Sort
View
136
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
127
Voted
ACMICEC
2004
ACM
125views ECommerce» more  ACMICEC 2004»
15 years 9 months ago
A web-based consumer-oriented intelligent decision support system for personalized e-services
Due to the rapid advancement of electronic commerce and web technologies in recent years, the concepts and applications of decision support systems have been significantly extende...
Chien-Chih Yu
124
Voted
TIT
2008
84views more  TIT 2008»
15 years 3 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
Michael Langberg, Alexander Sprintson, Jehoshua Br...
130
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
155
Voted
ER
2010
Springer
164views Database» more  ER 2010»
15 years 1 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone