1331 search results - page 231 / 267 » Complexity bounds for zero-test algorithms |
VIS
2006
IEEE
14 years 9 months ago
2006
IEEE
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
DIALM
2003
ACM
14 years 29 days ago
2003
ACM
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...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...