2272 search results - page 219 / 455 » Capture Complexity by Partition |
111
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
127
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The convergence of TV and new features such as Internet and games, requires a generic media-processing platform, that enables simultaneous execution of very diverse tasks, ranging...
126
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
114
Voted
SPIN
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
137
Voted
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mecha...