Sciweavers

587 search results - page 60 / 118
» Theory of matching pursuit
Sort
View
JCT
2011
66views more  JCT 2011»
14 years 6 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 18 hour ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
ICDE
2004
IEEE
111views Database» more  ICDE 2004»
16 years 1 months ago
Modeling Uncertainties in Publish/Subscribe Systems
In the publish/subscribe paradigm, information providers disseminate publications to all consumers who have expressed interest by registering subscriptions. This paradigm has foun...
Haifeng Liu, Hans-Arno Jacobsen
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
72
Voted
ATAL
2009
Springer
15 years 6 months ago
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
Valentin Goranko, Dmitry Shkatov