Sciweavers

915 search results - page 87 / 183
» Proof labeling schemes
Sort
View
ACL
2006
13 years 9 months ago
Minority Vote: At-Least-N Voting Improves Recall for Extracting Relations
Several NLP tasks are characterized by asymmetric data where one class label NONE, signifying the absence of any structure (named entity, coreference, relation, etc.) dominates al...
Nanda Kambhatla
AROBOTS
2010
128views more  AROBOTS 2010»
13 years 8 months ago
Track-based self-supervised classification of dynamic obstacles
Abstract This work introduces a self-supervised architecture for robust classification of moving obstacles in urban environments. Our approach presents a hierarchical scheme that r...
Roman Katz, Juan Nieto, Eduardo Mario Nebot, Bertr...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
ICC
2007
IEEE
14 years 2 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen
INFOCOM
2007
IEEE
14 years 2 months ago
CR Switch: A Load-Balanced Switch with Contention and Reservation
—Load-balanced switches have received a great deal of attention recently as they are much more scalable than other existing switch architectures in the literature. However, as th...
Chao-Lin Yu, Cheng-Shang Chang, Duan-Shin Lee