Sciweavers

1322 search results - page 101 / 265
» Parameterized counting problems
Sort
View
ADMA
2006
Springer
137views Data Mining» more  ADMA 2006»
14 years 21 days ago
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
Jinlong Wang, Congfu Xu, Hongwei Dan, Yunhe Pan
APNOMS
2006
Springer
14 years 20 days ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han
AAAI
2008
13 years 11 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...
NAACL
2010
13 years 6 months ago
An Exploration of Off Topic Conversation
In a corpus of expert tutoring dialogue, conversation that is considered to be "off topic" (non-pedagogical) according to a previous coding scheme is explored for its va...
Whitney L. Cade, Blair Lehman, Andrew Olney
DAC
2011
ACM
12 years 8 months ago
Full-chip TSV-to-TSV coupling analysis and optimization in 3D IC
This paper studies TSV-to-TSV coupling in 3D ICs. A full-chip SI analysis flow is proposed based on the proposed coupling model. Analysis results show that TSVs cause significan...
Chang Liu, Taigon Song, Jonghyun Cho, Joohee Kim, ...