6881 search results - page 1022 / 1377 » Motivation |
185
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
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 ...
135
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
311
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Efficiently managing storage is important for virtualized computing environments. Its importance is magnified by developments such as cloud computing which consolidate many thousa...
205
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
314
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...