Sciweavers

552 search results - page 86 / 111
» Lower bounds for dynamic connectivity
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
TON
2008
124views more  TON 2008»
13 years 7 months ago
Designing packet buffers for router linecards
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
Sundar Iyer, Ramana Rao Kompella, Nick McKeown
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 10 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 8 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis