Results 11  20
of
2,332
NONIDENTICAL DUPLICATE VIDEO DETECTION USING THE SIFT METHOD
"... NonIdentical Duplicate video detection is a challenging research problem. NonIdentical Duplicate video are a pair of videos that are not exactly identical but are almost similar. In this paper, we evaluate two methods Keyframebased and Tomographybased methods to determine the NonIdentical Dupl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of accuracy and efficiency of the above two methods on a data set of NonIdentical Duplicate videopair. 1
Heuristic algorithms for scheduling independent tasks on nonidentical processors
 Journal of the ACM
, 1977
"... ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1)/2 of the optima ..."
Abstract

Cited by 247 (0 self)
 Add to MetaCart
)/2 of the optimal hmshmg time A simplified scheduling problem involving identical processors and restricted task sets is shown to be Pcomplete However, the LPT algorithm applied to this problem yields schedules which are near optimal for large n KEY WORDS AND PHRASES finishing time, heuristic algorithm, scheduling
A Consensus Framework for Integrating Distributed Clusterings Under Limited Knowledge Sharing
 In Proc. NSF Workshop on Next Generation Data Mining
, 2002
"... This paper examines the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. This problem is an abstraction of scenarios where different organizations have grouped some ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
. Three effective and efficient techniques for obtaining highquality consensus functions are described and studied empirically for the following qualitatively different application scenarios: (i) where the original clusters were formed based on nonidentical sets of features, (ii) where the original
Permutation Groups Whose NonIdentity Elements Have K Fixed Points
"... In this note I prove an asymptotic structure theorem for groups with the property that any nonidentity element xes exactly k points. I also look briey at the innite analogue, and at a conjectured analogue for groups with prescribed sets of xedpoint numbers. Let K be a set of nonnegative integ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note I prove an asymptotic structure theorem for groups with the property that any nonidentity element xes exactly k points. I also look briey at the innite analogue, and at a conjectured analogue for groups with prescribed sets of xedpoint numbers. Let K be a set of non
Online Learning with Samples Drawn from Nonidentical Distributions
"... Learning algorithms are based on samples which are often drawn independently from an identical distribution (i.i.d.). In this paper we consider a different setting with samples drawn according to a nonidentical sequence of probability distributions. Each time a sample is drawn from a different dist ..."
Abstract
 Add to MetaCart
Learning algorithms are based on samples which are often drawn independently from an identical distribution (i.i.d.). In this paper we consider a different setting with samples drawn according to a nonidentical sequence of probability distributions. Each time a sample is drawn from a different
Predicting the secondary structure of globular proteins using neural networks models
 J. Molecular Biology
, 1988
"... We present a new method for predicting the secondary structure of globular proteins based on nonlinear neural network models. Network models learn from existing protein structures how to predict the secondary structure of local sequences of amino acids. The average success rate of our method on a t ..."
Abstract

Cited by 271 (2 self)
 Add to MetaCart
testing set of proteins nonhomologous with the corresponding training set was 643 % on three types of secondary structure (uhelix, bsheet, and coil), with correlation coefficients of C,=O41, C,=O*31 and CcO,, =0*41. These quality indices are all higher than those of previous methods. The prediction
MaxMin DCluster Formation in Wireless Ad Hoc Networks
 IN PROCEEDINGS OF IEEE INFOCOM
, 2000
"... An ad hoc network may be logically represented as a set of clusters. The clusterheads form a dhop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselv ..."
Abstract

Cited by 268 (4 self)
 Add to MetaCart
themselves to 1hop clusters. We show that the minimum dhop dominating set problem is NPcomplete. Then we present a heuristic to form dclusters in a wireless ad hoc network. Nodes are assumed to have nondeterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless
PerfectlySecure Key Distribution for Dynamic Conferences
, 1995
"... A key distribution scheme for dynamic conferences is a method by which initially an (offline) trusted server distributes private individual pieces of information to a set of users. Later, each member of any group of users of a given size (a dynamic conference) can compute a common secure group key. ..."
Abstract

Cited by 265 (5 self)
 Add to MetaCart
. In this paper we study the theory and applications of such perfectly secure systems. In this setting, any group of t users can compute a common key by each user computing using only his private initial piece of information and the identities of the other t \Gamma 1 users in the group. Keys are secure against
Using Experimental Economics to Measure Social Capital and Predict Financial Decisions,” Working Paper
, 2002
"... Abstract: Questions remain as to whether results from experimental economics games are generalizable to real decisions in nonlaboratory settings. I conduct a survey and two experiments, a Trust game and a Public Goods game, to measure social capital. Social capital purports to provide incentives to ..."
Abstract

Cited by 229 (21 self)
 Add to MetaCart
Abstract: Questions remain as to whether results from experimental economics games are generalizable to real decisions in nonlaboratory settings. I conduct a survey and two experiments, a Trust game and a Public Goods game, to measure social capital. Social capital purports to provide incentives
Person identification using multiple cues
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... AbstractThis paper presents a person identification system based on acoustic and visual features. The system is organized as a set of nonhomogeneous classifiers whose outputs are integrated after a normalization step. In particular, two classifiers based on acoustic features and three based on vis ..."
Abstract

Cited by 217 (1 self)
 Add to MetaCart
AbstractThis paper presents a person identification system based on acoustic and visual features. The system is organized as a set of nonhomogeneous classifiers whose outputs are integrated after a normalization step. In particular, two classifiers based on acoustic features and three based
Results 11  20
of
2,332