Sciweavers

920 search results - page 79 / 184
» Computing the Frequency of Partial Orders
Sort
View
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
15 years 3 months ago
To Do or Not To Do: The Dilemma of Disclosing Anonymized Data
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Rames...
IUI
2010
ACM
15 years 6 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo
CIKM
2005
Springer
15 years 3 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima
EWC
2002
86views more  EWC 2002»
14 years 9 months ago
On Object-Oriented Frameworks and Coordinate Free Formulations of PDEs
An object-oriented (OO) framework for Partial tial Equations (PDEs) provides software abstractions for numerical simulation of PDEs. The design of such frameworks is not trivial, a...
Magne Haveraaen, Hans Z. Munthe-Kaas, Krister &Ari...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna