Sciweavers

514 search results - page 97 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
INFSOF
2010
113views more  INFSOF 2010»
13 years 6 months ago
Package Fingerprints: A visual summary of package interface usage
Context: Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages. Maintainers of large systems need to understand how packages relate to...
Hani Abdeen, Stéphane Ducasse, Damien Polle...
ECCC
2010
83views more  ECCC 2010»
13 years 4 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
EIT
2008
IEEE
14 years 1 months ago
Taming XML: Objects first, then markup
Abstract—Processing markup in object-oriented languages often requires the programmer to focus on the objects generating the markup rather than the more pertinent domain objects....
Matt Bone, Peter F. Nabicht, Konstantin Läufe...
INFOCOM
2007
IEEE
14 years 1 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...