19866 search results - page 228 / 3974 » Computing all factorizations in *** |
181
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
177
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
174
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
182
click to vote
IAT
2005
IEEE
16 years 7 days ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
160
click to vote
ESA
2005
Springer
16 years 4 days ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...