Sciweavers

3991 search results - page 640 / 799
» Bounding homogeneous models
Sort
View
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 6 months ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
ECCV
2002
Springer
16 years 5 months ago
Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
Dana Cobzas, Martin Jägersand
ICSE
2005
IEEE-ACM
16 years 4 months ago
Automatic discovery of API-level exploits
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Tho...
MOBIHOC
2006
ACM
16 years 3 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 1 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...