Sciweavers

357 search results - page 53 / 72
» Fast Hypergraph Partition
Sort
View
FAST
2004
13 years 10 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 8 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
FAST
2009
13 years 6 months ago
Minuet: Rethinking Concurrency Control in Storage Area Networks
Clustered applications in storage area networks (SANs), widely adopted in enterprise datacenters, have traditionally relied on distributed locking protocols to coordinate concurre...
Andrey Ermolinskiy, Daekyeong Moon, Byung-Gon Chun...
FAST
2009
13 years 6 months ago
Perspective: Semantic Data Management for the Home
Perspective is a storage system designed for the home, with the decentralization and flexibility sought by home users and a new semantic filesystem construct, the view, to simplif...
Brandon Salmon, Steven W. Schlosser, Lorrie Faith ...
ICCAD
2005
IEEE
125views Hardware» more  ICCAD 2005»
14 years 5 months ago
Robust mixed-size placement under tight white-space constraints
A novel and very simple correct-by-construction top-down methodology for high-utilization mixed-size placement is presented. The PolarBear algorithm combines recursive cutsize-dri...
Jason Cong, Michail Romesis, Joseph R. Shinnerl