Sciweavers

118 search results - page 22 / 24
» Complexity Cores and Hard Problem Instances
Sort
View
103
Voted
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 7 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
98
Voted
LLL
1999
Springer
15 years 1 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec
64
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
IP-Subnet Aware Routing in WDM Mesh Networks
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anur...
SAC
2009
ACM
15 years 4 months ago
Remote software protection by orthogonal client replacement
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
Mariano Ceccato, Paolo Tonella, Mila Dalla Preda, ...
EOR
2011
140views more  EOR 2011»
14 years 1 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...