Sciweavers

377 search results - page 34 / 76
» Distributed computation under bit constraints
Sort
View
ECCV
1998
Springer
14 years 9 months ago
A Two-Stage Probabilistic Approach for Object Recognition
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
Stan Z. Li, Joachim Hornegger
KIVS
2005
Springer
14 years 1 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 7 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CASCON
1996
126views Education» more  CASCON 1996»
13 years 9 months ago
Evaluating the costs of management: a distributed applications management testbed
In today's distributed computing environments, users are makingincreasing demands on the systems, networks, and applications they use. Users are coming to expect performance,...
Michael Katchabaw, Stephen L. Howard, Andrew D. Ma...
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...