Sciweavers

2647 search results - page 275 / 530
» Solving Term Inequalities
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 7 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
KDD
2008
ACM
166views Data Mining» more  KDD 2008»
16 years 7 months ago
Generating succinct titles for web URLs
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 7 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...