Sciweavers

439 search results - page 48 / 88
» Choiceless Computation and Symmetry
Sort
View
ACL
2009
14 years 7 months ago
Coordinate Structure Analysis with Global Structural Constraints and Alignment-Based Local Features
We propose a hybrid approach to coordinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sentence, and features bas...
Kazuo Hara, Masashi Shimbo, Hideharu Okuma, Yuji M...
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
14 years 4 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
MICCAI
2008
Springer
15 years 11 months ago
New Algorithms to Map Asymmetries of 3D Surfaces
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
Benoît Combès, Sylvain Prima
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
15 years 6 months ago
ACG-Adjacent Constraint Graph for General Floorplans
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
Hai Zhou, Jia Wang
CP
2009
Springer
15 years 4 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...