8728 search results - page 1642 / 1746 » On Reduct Construction Algorithms |
212
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
128
Voted
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
119
click to vote
SODA
2010
ACM
16 years 24 days ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
123
Voted
WISE
2009
Springer
16 years 17 days ago
2009
Springer
Web-based environments typically span interactions between humans and software services. The management and automatic calculation of trust are among the key challenges of the futur...
143
Voted
PEPM
2009
ACM
16 years 9 days ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...