Sciweavers

2168 search results - page 339 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
IJCAI
2007
15 years 4 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
WSC
1998
15 years 4 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
JSAC
2006
183views more  JSAC 2006»
15 years 3 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran
VR
2008
IEEE
175views Virtual Reality» more  VR 2008»
15 years 3 months ago
Managing Visual Clutter: A Generalized Technique for Label Segregation using Stereoscopic Disparity
We present a new technique for managing visual clutter caused by overlapping labels in complex information displays. This technique, "label layering", utilizes stereosco...
Stephen Peterson, Magnus Axholt, Stephen R. Ellis