Sciweavers

4047 search results - page 363 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
CCGRID
2003
IEEE
15 years 12 months ago
Discretionary Caching for I/O on Clusters
I/O bottlenecks are already a problem in many largescale applications that manipulate huge datasets. This problem is expected to get worse as applications get larger, and the I/O ...
Murali Vilayannur, Anand Sivasubramaniam, Mahmut T...
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
JUCS
2010
176views more  JUCS 2010»
15 years 5 months ago
An Approach to Generation of Decision Rules
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
Zhang Mingyi, Danning Li, Zhang Ying
GLOBECOM
2007
IEEE
16 years 29 days ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
AI
1998
Springer
15 years 11 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels