Sciweavers

5210 search results - page 758 / 1042
» Exact geometric computation
Sort
View
STACS
2010
Springer
15 years 10 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
SAC
2010
ACM
15 years 10 months ago
Design pattern implementation in object teams
Implementing the 23 Gang-of-Four design patterns in the aspectoriented programming language Object Teams/Java (OT/J) yields modularity and reusability results roughly comparable t...
João L. Gomes, Miguel P. Monteiro
186
Voted
AINA
2009
IEEE
15 years 10 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
132
Voted
AINA
2009
IEEE
15 years 10 months ago
Similarity Search over DNS Query Streams for Email Worm Detection
Email worms continue to be a persistent problem, indicating that current approaches against this class of selfpropagating malicious code yield rather meagre results. Additionally,...
Nikolaos Chatzis, Nevil Brownlee
143
Voted
CP
2009
Springer
15 years 10 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan