Sciweavers

9631 search results - page 1727 / 1927
» The Costs of Using JXTA
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICALP
2009
Springer
16 years 6 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
SIGMOD
2009
ACM
197views Database» more  SIGMOD 2009»
16 years 6 months ago
Secure kNN computation on encrypted databases
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...
Wai Kit Wong, David Wai-Lok Cheung, Ben Kao, Nikos...
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
16 years 6 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li
SIGMOD
2007
ACM
141views Database» more  SIGMOD 2007»
16 years 6 months ago
Storage workload estimation for database management systems
Modern storage systems are sophisticated. Simple directattached storage devices are giving way to storage systems that are shared, flexible, virtualized and network-attached. Toda...
Oguzhan Ozmen, Kenneth Salem, Mustafa Uysal, M. Ho...
« Prev « First page 1727 / 1927 Last » Next »