Sciweavers

15485 search results - page 2837 / 3097
» Computing Optimal Subsets
Sort
View
WINE
2010
Springer
148views Economy» more  WINE 2010»
15 years 4 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
15 years 4 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
EDBT
2009
ACM
137views Database» more  EDBT 2009»
15 years 4 months ago
Flexible and scalable storage management for data-intensive stream processing
Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing...
Irina Botan, Gustavo Alonso, Peter M. Fischer, Don...
FMCO
2009
Springer
134views Formal Methods» more  FMCO 2009»
15 years 4 months ago
Verification of Context-Dependent Channel-Based Service Models
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
Natallia Kokash, Christian Krause, Erik P. de Vink
ICDAR
2009
IEEE
15 years 4 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...
« Prev « First page 2837 / 3097 Last » Next »