Sciweavers

2957 search results - page 464 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
KAIS
2008
150views more  KAIS 2008»
13 years 9 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
SMA
2008
ACM
157views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Interactive physically-based shape editing
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...
Johannes Mezger, Bernhard Thomaszewski, Simon Pabs...
JALC
2007
90views more  JALC 2007»
13 years 9 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
BMCBI
2005
122views more  BMCBI 2005»
13 years 9 months ago
Quantitative analysis of EGR proteins binding to DNA: assessing additivity in both the binding site and the protein
Background: Recognition codes for protein-DNA interactions typically assume that the interacting positions contribute additively to the binding energy. While this is known to not ...
Jiajian Liu, Gary D. Stormo
JSAC
2007
133views more  JSAC 2007»
13 years 9 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...