Sciweavers

463 search results - page 64 / 93
» The lattice dimension of a graph
Sort
View
AIEDAM
2007
90views more  AIEDAM 2007»
14 years 9 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
PAMI
2010
222views more  PAMI 2010»
14 years 8 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
ICALP
2011
Springer
14 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
15 years 2 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
14 years 15 days ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...