Sciweavers

1272 search results - page 114 / 255
» The Set Cover with Pairs Problem
Sort
View
83
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
Points with large quadrant-depth
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom ...
93
Voted
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
102
Voted
IJMMS
1998
114views more  IJMMS 1998»
15 years 12 days ago
The design and evolution of TurboTurtle, a collaborative microworld for exploring Newtonian physics
controls, recoverability, and how strictly views should be shared between students. Teachers can also add structure to the group’s activities by setting the simulation environmen...
Andy Cockburn, Saul Greenberg
92
Voted
SEMWEB
2009
Springer
15 years 7 months ago
Graph-Based Ontology Construction from Heterogenous Evidences
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
Christoph Böhm, Philip Groth, Ulf Leser
137
Voted
ALGOSENSORS
2007
Springer
15 years 4 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis