Sciweavers

19798 search results - page 246 / 3960
» Is Structural Subtyping Useful
Sort
View
108
Voted
CG
2007
Springer
15 years 23 days ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
89
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 8 days ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
197
Voted
POPL
2008
ACM
16 years 1 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
109
Voted
ACSC
2009
IEEE
15 years 7 months ago
A ConceptLink Graph for Text Structure Mining
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
Rowena Chau, Ah Chung Tsoi, Markus Hagenbuchner, V...
115
Voted
CP
2007
Springer
15 years 7 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner