Sciweavers

3600 search results - page 500 / 720
» The settling-time reducibility ordering
Sort
View
EDBT
2010
ACM
132views Database» more  EDBT 2010»
15 years 10 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
AAAI
2008
15 years 9 months ago
CRF-OPT: An Efficient High-Quality Conditional Random Field Solver
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
Minmin Chen, Yixin Chen, Michael R. Brent
AAAI
2008
15 years 9 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
184
Voted
MOBISYS
2010
ACM
15 years 9 months ago
Characterizing the transport behaviour of the short message service
We build an efficient and reliable data transport protocol on top of the Short Message Service (SMS). We conduct a series of experiments to characterize SMS behaviour under bursty...
Earl Oliver
AAAI
2008
15 years 9 months ago
Reinforcement Learning for Vulnerability Assessment in Peer-to-Peer Networks
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
Scott Dejmal, Alan Fern, Thinh Nguyen