Sciweavers

779 search results - page 117 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 10 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
P2P
2002
IEEE
178views Communications» more  P2P 2002»
15 years 9 months ago
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...
Mario T. Schlosser, Michael Sintek, Stefan Decker,...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 8 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
14 years 7 months 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...
BIBM
2010
IEEE
286views Bioinformatics» more  BIBM 2010»
15 years 2 months ago
Evaluation of short read metagenomic assembly
Advances in sequencing technologies have equipped researchers with the ability to sequence the collective genome of entire microbial communities commonly referred to as metagenomi...
Anveshi Charuvaka, Huzefa Rangwala