Sciweavers

460 search results - page 68 / 92
» A Comparison of Functional and Structural Partitioning
Sort
View
DCG
2010
171views more  DCG 2010»
13 years 9 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
PR
2008
169views more  PR 2008»
13 years 8 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 8 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
TVLSI
1998
83views more  TVLSI 1998»
13 years 8 months ago
Low overhead fault-tolerant FPGA systems
— Fault-tolerance is an important system metric for many operating environments, from automotive to space exploration. The conventional technique for improving system reliability...
John Lach, William H. Mangione-Smith, Miodrag Potk...
EMNLP
2010
13 years 7 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple