Sciweavers

12487 search results - page 2338 / 2498
» Graspable Work Modeling
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 4 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 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
VLDB
2008
ACM
170views Database» more  VLDB 2008»
16 years 4 months ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
16 years 4 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
« Prev « First page 2338 / 2498 Last » Next »