Sciweavers

2107 search results - page 391 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
COMPGEOM
2011
ACM
14 years 9 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
BROADNETS
2004
IEEE
15 years 9 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
ANCS
2005
ACM
15 years 11 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
CLOUD
2010
ACM
15 years 11 months ago
Fluxo: a system for internet service programming by non-expert developers
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
Emre Kiciman, V. Benjamin Livshits, Madanlal Musuv...
CHI
1993
ACM
15 years 10 months ago
Exploring the applications of user-expertise assessment for intelligent interfaces
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
Michel Desmarais, Jiming Liu