Sciweavers

2168 search results - page 212 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
BMVC
2010
15 years 1 months ago
Large-scale Dictionary Learning For Local Coordinate Coding
Local coordinate coding has recently been introduced to learning visual feature dictionary and achieved top level performance for object recognition. However, the computational co...
Bo Xie, Mingli Song, Dacheng Tao
SIGSOFT
2006
ACM
15 years 9 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
APAL
2007
131views more  APAL 2007»
15 years 3 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
150
Voted
AUTONOMICS
2009
ACM
15 years 10 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...