Sciweavers

4913 search results - page 660 / 983
» Results and Perspectives of the G
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
BMCBI
2008
99views more  BMCBI 2008»
15 years 7 months ago
A new real-time PCR method to overcome significant quantitative inaccuracy due to slight amplification inhibition
Background: Real-time PCR analysis is a sensitive DNA quantification technique that has recently gained considerable attention in biotechnology, microbiology and molecular diagnos...
Michele Guescini, Davide Sisti, Marco B. L. Rocchi...
TCOM
2008
84views more  TCOM 2008»
15 years 6 months ago
On the Performance of Closed-Loop Transmit Diversity with Noisy Channel Estimates and Finite-Depth Interleaved Convolutional Cod
Abstract-- In this paper, closed-form expressions for the uncoded bit error probability of closed-loop transmit diversity (CLTD) algorithms with two transmit and one receive antenn...
Jittra Jootar, James R. Zeidler, John G. Proakis
VLDB
2006
ACM
490views Database» more  VLDB 2006»
17 years 6 months ago
The New Casper: Query Processing for Location Services without Compromising Privacy
This paper tackles a major privacy concern in current location-based services where users have to continuously report their locations to the database server in order to obtain the ...
Mohamed F. Mokbel, Chi-Yin Chow, Walid G. Aref