Sciweavers

9842 search results - page 1968 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICRA
1999
IEEE
114views Robotics» more  ICRA 1999»
13 years 11 months ago
Smoother Based 3-D Attitude Estimation for Mobile Robot Localization
The mobile robot localization problem is decomposed into two stages attitude estimation followed by position estimation. The innovation of our method is the use of a smoother, in ...
Stergios I. Roumeliotis, Gaurav S. Sukhatme, Georg...
INFOCOM
1999
IEEE
13 years 11 months ago
An Architecture for Noncooperative QoS Provision in Many-Switch Systems
With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an ...
Shaogang Chen, Kihong Park
WWW
2009
ACM
14 years 8 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
« Prev « First page 1968 / 1969 Last » Next »