Sciweavers

16404 search results - page 2680 / 3281
» A set coverage problem
Sort
View
EUROCRYPT
2007
Springer
15 years 11 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 11 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
SIGIR
2010
ACM
15 years 11 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
FORMATS
2007
Springer
15 years 11 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
SUTC
2010
IEEE
15 years 11 months ago
Link Scheduling in a Single Broadcast Domain Underwater Networks
Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic w...
Pai-Han Huang, Ying Chen, Bhaskar Krishnamachari, ...
« Prev « First page 2680 / 3281 Last » Next »