851 search results - page 99 / 171 » Random constructions and density results |
141
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
155
click to vote
ISCC
2005
IEEE
15 years 9 months ago
2005
IEEE
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
118
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
118
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
130
click to vote
NAACL
2003
15 years 4 months ago
2003
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...