Sciweavers

420 search results - page 60 / 84
» Discovering Conditional Functional Dependencies
Sort
View
MOBIHOC
2003
ACM
14 years 9 months ago
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
Venugopalan Ramasubramanian, Zygmunt J. Haas, Emin...
ISSTA
2009
ACM
14 years 4 months ago
Loop-extended symbolic execution on binary programs
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...
EAAI
2007
93views more  EAAI 2007»
13 years 10 months ago
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
: In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these m...
Izabela Brzezinska, Salvatore Greco, Roman Slowins...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
13 years 23 days ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
14 years 7 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...