5624 search results - page 851 / 1125 » On Conditional Covering Problem |
133
Voted
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
167
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
133
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
130
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...