Sciweavers

5005 search results - page 898 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
SIGMOD
2005
ACM
74views Database» more  SIGMOD 2005»
16 years 3 months ago
Online B-tree Merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendo...
MOBIHOC
2008
ACM
16 years 3 months ago
Cooperative transmit-power estimation under wireless fading
We study blind estimation of transmission power of a node based on received power measurements obtained under wireless fading. Specifically, the setup consists of a set of monitor...
Murtaza Zafer, Bongjun Ko, Ivan Wang Hei Ho
HYPERTEXT
2009
ACM
16 years 29 days ago
A scalable, collaborative similarity measure for social annotation systems
Collaborative annotation tools are in widespread use. The metadata from these systems can be mined to induce semantic relationships among Web objects (sites, pages, tags, concepts...
Benjamin Markines, Filippo Menczer
EUROSYS
2009
ACM
16 years 27 days ago
Improving the responsiveness of internet services with automatic cache placement
The backends of today’s Internet services rely heavily on caching at various layers both to provide faster service to common requests and to reduce load on back-end components. ...
Alexander Rasmussen, Emre Kiciman, V. Benjamin Liv...
PADL
2010
Springer
16 years 20 days ago
Similar Code Detection and Elimination for Erlang Programs
A well-known bad code smell in refactoring and software maintenance is duplicated code, that is the existence of code clones, which are code fragments that are identical or similar...
Huiqing Li, Simon Thompson