Sciweavers

5606 search results - page 776 / 1122
» Randomization Techniques for Graphs.
Sort
View
FOSSACS
2008
Springer
15 years 8 months ago
Compositional Methods for Information-Hiding
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
Christelle Braun, Konstantinos Chatzikokolakis, Ca...
NIPS
2007
15 years 8 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
ACL
2006
15 years 8 months ago
Subword-Based Tagging for Confidence-Dependent Chinese Word Segmentation
We proposed a subword-based tagging for Chinese word segmentation to improve the existing character-based tagging. The subword-based tagging was implemented using the maximum entr...
Ruiqiang Zhang, Gen-ichiro Kikui, Eiichiro Sumita
GRAPHICSINTERFACE
2003
15 years 8 months ago
A Stream Algorithm for the Decimation of Massive Meshes
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
Jianhua Wu, Leif Kobbelt