Sciweavers

957 search results - page 45 / 192
» Addition Chain Heuristics
Sort
View
IJCGA
2007
76views more  IJCGA 2007»
13 years 10 months ago
Immobilizing Hinged Polygons
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
Jae-Sook Cheong, A. Frank van der Stappen, Kenneth...
DLOG
2009
13 years 7 months ago
Soundness Preserving Approximation for TBox Reasoning in R
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
TWC
2011
291views more  TWC 2011»
13 years 5 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
CVPR
2009
IEEE
1119views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Adaptive Contour Features in Oriented Granular Space for Human Detection and Segmentation
In this paper, a novel feature named Adaptive Contour Feature (ACF) is proposed for human detection and segmentation. This feature consists of a chain of a number of granules in...
Wei Gao (Tsinghua University), Haizhou Ai (Tsinghu...
ICML
2005
IEEE
14 years 11 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III