15073 search results - page 2710 / 3015 » Probabilistic algorithms for computing resultants |
171
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
176
click to vote
LOCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
114
click to vote
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we present results of experimental work using machine learning techniques to rapidly identify Skype traffic. We show that Skype traffic can be identified by observin...
121
click to vote
APGV
2009
ACM
15 years 10 months ago
2009
ACM
An inadequately designed display viewed in the dark can easily cause dazzling glare and affect our night vision. In this paper we test a display design in which the spectral light...
149
click to vote
CASES
2009
ACM
15 years 10 months ago
2009
ACM
Coarse-grained reconfigurable architectures (CGRAs) present an appealing hardware platform by providing programmability with the potential for high computation throughput, scalab...