Sciweavers

5451 search results - page 21 / 1091
» On very high degrees
Sort
View
JOC
2006
80views more  JOC 2006»
13 years 9 months ago
Elliptic Curves with Low Embedding Degree
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
Florian Luca, Igor Shparlinski
FSKD
2005
Springer
162views Fuzzy Logic» more  FSKD 2005»
14 years 3 months ago
Fuzzy-C-Mean Determines the Principle Component Pairs to Estimate the Degree of Emotion from Facial Expressions
Although many systems exist for automatic classification of faces according to their emotional expression, these systems do not explicitly estimate the strength of given expression...
M. Ashraful Amin, Nitin V. Afzulpurkar, Matthew N....
JGT
2007
68views more  JGT 2007»
13 years 9 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 2 months ago
Evaluating very large datalog queries on social networks
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Royi Ronen, Oded Shmueli
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir