8437 search results - page 673 / 1688 » Preferences over Sets |
197
click to vote
WIA
2004
Springer
16 years 23 days ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
221
click to vote
SIGECOM
2003
ACM
16 years 20 days ago
2003
ACM
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
160
click to vote
GECCO
2003
Springer
16 years 19 days ago
2003
Springer
It is clear from the study of complex non-linear systems in general, and evolutionary algorithms (EAs) in particular, that there is no single analysis tool or technique capable of ...
215
click to vote
PROPOR
2010
Springer
16 years 16 days ago
2010
Springer
In this paper we compare the robustness of several types of stylistic markers to help discriminate authorship at sentence level. We train a SVM-based classifier using each set of ...
223
click to vote
ICPR
2002
IEEE
16 years 11 days ago
2002
IEEE
Active Contour (or Snake) Model is recognized as one of the efficient tools for 2D/3D image segmentation. However, traditional snake models prove to be limited in several aspects...