Sciweavers

1461 search results - page 237 / 293
» Complexity of Graph Covering Problems
Sort
View
AAAI
2006
13 years 10 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
CIDR
2009
102views Algorithms» more  CIDR 2009»
13 years 10 months ago
Why Did My Query Slow Down
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
Nedyalko Borisov, Sandeep Uttamchandani, Ramani Ro...
TKDE
2008
121views more  TKDE 2008»
13 years 8 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
PAMI
2007
122views more  PAMI 2007»
13 years 8 months ago
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Anupama Jagannathan, Eric L. Miller
EUROMED
2010
13 years 7 months ago
Architectural Heritage Online: Ontology-Driven Website Generation for World Heritage Sites in Danger
We introduce an online knowledge base for semantic representation and annotation of a world heritage site in danger. For this purpose we designed ontology inside the protégé tool...
Elham Andaroodi, Asanobu Kitamoto