1964 search results - page 389 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
AAAI
2008
13 years 10 months ago
2008
The goal of my ongoing work is to provide an architecture for developing and manipulating modular ontologies in such a way that each ontology module can plug into or unplug from a...
DAC
2008
ACM
13 years 9 months ago
2008
ACM
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
IIR
2010
13 years 9 months ago
2010
Thanks to the continuous growth of collaborative platforms like YouTube, Flickr and Delicious, we are recently witnessing to a rapid evolution of web dynamics towards a more `soci...