Sciweavers

1760 search results - page 68 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
HUC
2007
Springer
14 years 3 months ago
Why It's Worth the Hassle: The Value of In-Situ Studies When Designing Ubicomp
How should Ubicomp technologies be evaluated? While lab studies are good at sensing aspects of human behavior and revealing usability problems, they are poor at capturing context o...
Yvonne Rogers, Kay Connelly, Lenore Tedesco, Willi...
FOCS
2000
IEEE
14 years 1 months ago
A polylogarithmic approximation of the minimum bisection
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
Uriel Feige, Robert Krauthgamer
AOSE
2005
Springer
14 years 2 months ago
Requirements Elicitation for Agent-Based Applications
Requirements elicitation for a software system is a key stage in a successful development. At the same time, it is one of the most challenging, because requirements have to conside...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
WIOPT
2006
IEEE
14 years 3 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
ICML
2004
IEEE
14 years 9 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik