Sciweavers

34170 search results - page 6673 / 6834
» Optimization
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 3 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
ISF
2006
118views more  ISF 2006»
15 years 3 months ago
Does information security attack frequency increase with vulnerability disclosure? An empirical analysis
Abstract Research in information security, risk management and investment has grown in importance over the last few years. However, without reliable estimates on attack probabiliti...
Ashish Arora, Anand Nandkumar, Rahul Telang
118
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 3 months ago
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
Jeffrey G. Andrews, Nihar Jindal, Martin Haenggi, ...
JMLR
2008
168views more  JMLR 2008»
15 years 3 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
119
Voted
JNCA
2008
86views more  JNCA 2008»
15 years 3 months ago
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
Xiao Qin
« Prev « First page 6673 / 6834 Last » Next »