9842 search results - page 1960 / 1969 » The Complexity of the Matching-Cut Problem |
MICRO
2002
IEEE
14 years 11 days ago
2002
IEEE
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
22
Voted
VR
2002
IEEE
14 years 11 days ago
2002
IEEE
VRML97 allows the description of dynamic worlds that can change with both the passage of time, and user interaction. Unfortunately, the current VRML usage model prevents its full ...
STOC
2010
ACM
14 years 10 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
SIGMOD
2010
ACM
14 years 8 days ago
2010
ACM
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
SIGMOD
2010
ACM
14 years 8 days ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...