Sciweavers

223 search results - page 36 / 45
» Proving Termination by Bounded Increase
Sort
View
72
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
96
Voted
ECRTS
2006
IEEE
15 years 3 months ago
Real-Time Memory Management: Life and Times
As real-time and embedded systems become increasingly large and complex, the traditional strictly static approach to memory management begins to prove untenable. The challenge is ...
Andrew Borg, Andy J. Wellings, Christopher D. Gill...
CIKM
2006
Springer
15 years 1 months ago
Privacy preserving sequential pattern mining in distributed databases
Research in the areas of privacy preserving techniques in databases and subsequently in privacy enhancement technologies have witnessed an explosive growth-spurt in recent years. ...
Vishal Kapoor, Pascal Poncelet, François Tr...
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 11 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen