Sciweavers

4679 search results - page 13 / 936
» Modeling When Connections Are the Problem
Sort
View
FSTTCS
2005
Springer
15 years 3 months ago
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
Béatrice Bérard, Franck Cassez, Serg...
ICDE
2009
IEEE
392views Database» more  ICDE 2009»
16 years 9 months ago
FF-Anonymity: When Quasi-Identifiers Are Missing
Existing approaches on privacy-preserving data publishing rely on the assumption that data can be divided into quasi-identifier attributes (QI) and sensitive attribute (SA). This ...
Ada Wai-Chee Fu, Ke Wang, Raymond Chi-Wing Wong, Y...
SIGIR
2011
ACM
14 years 17 days ago
When documents are very long, BM25 fails!
We reveal that the Okapi BM25 retrieval function tends to overly penalize very long documents. To address this problem, we present a simple yet effective extension of BM25, namel...
Yuanhua Lv, ChengXiang Zhai
DCC
2005
IEEE
15 years 9 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
Security when people matter: structuring incentives for user behavior
Humans are "smart components" in a system, but cannot be directly programmed to perform; rather, their autonomy must be respected as a design constraint and incentives p...
Rick Wash, Jeffrey K. MacKie-Mason