1964 search results - page 210 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...