Sciweavers

656 search results - page 124 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
STACS
2007
Springer
14 years 1 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
ICCV
2007
IEEE
14 years 9 months ago
Temporal Segmentation of Facial Behavior
Temporal segmentation of facial gestures in spontaneous facial behavior recorded in real-world settings is an important, unsolved, and relatively unexplored problem in facial imag...
Fernando De la Torre, Joan Campoy, Zara Ambadar, J...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 22 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
PAM
2009
Springer
14 years 2 months ago
On the 95-Percentile Billing Method
Abstract. The 95-percentile method is used widely for billing ISPs and websites. In this work, we characterize important aspects of the 95-percentile method using a large set of tr...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...