Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Amihood Amir

Papers on DiSC'04


Efficient Multidimensional Quantitative Hypotheses Generation

Analyzing High-Dimensional Data by Subspace Validity

Publications


Note: Links lead to the DBLP on the Web.

Amihood Amir

Amihood Amir, Ayelet Butman , Maxime Crochemore , Gad M. Landau , Malka Schaps : Two-Dimensional Pattern Matching with Rotations. CPM 2003 : 17-31

Yair Horesh , Amihood Amir, Shulamit Michaeli , Ron Unger : A rapid method for detection of putative RNAi target genes in genomic data. ECCB 2003 : 73-80

Amihood Amir, Yonatan Aumann , Richard Cole , Moshe Lewenstein , Ely Porat : Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003 : 929-942

Amihood Amir, Reuven Kashi , Nathan S. Netanyahu : Efficient Multidimensional Quantitative Hypotheses Generation. ICDM 2003 : 3-10

Amihood Amir, Reuven Kashi , Nathan S. Netanyahu , Daniel A. Keim , Markus Wawryniuk : Analyzing High-Dimensional Data by Subspace Validity. ICDM 2003 : 473-476

Amihood Amir, Gad M. Landau , Dina Sokol : Inplace 2D matching in compressed images. SODA 2003 : 853-862

Amihood Amir, Gad M. Landau , Moshe Lewenstein , Dina Sokol : Dynamic Text and Static Pattern Matching. WADS 2003 : 340-352

Amihood Amir, Ayelet Butman , Moshe Lewenstein , Ely Porat : Real Two Dimensional Scaled Matching. WADS 2003 : 353-364

Amihood Amir, Richard Cole , Ramesh Hariharan , Moshe Lewenstein , Ely Porat : Overlap matching. Inf. Comput. 181 (1): 57-74 (2003)

Amihood Amir, Richard Beigel , William I. Gasarch : Some connections between bounded query classes and non-uniform complexity. Inf. Comput. 186 (1): 104-139 (2003)

Amihood Amir, Gad M. Landau , Dina Sokol : Inplace 2D matching in compressed images. J. Algorithms 49 (2): 240-261 (2003)

Amihood Amir, Alberto Apostolico , Gad M. Landau , Giorgio Satta : Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1 (5-6): 409-421 (2003)

Amihood Amir, Gad M. Landau , Dina Sokol : Inplace run-length 2d compressed search. Theor. Comput. Sci. 290 (3): 1361-1383 (2003)

Amihood Amir, Kenneth Ward Church , Emanuel Dar : Separable attributes: a technique for solving the sub matrices character count problem. SODA 2002 : 400-401

Amihood Amir, Gad M. Landau , Esko Ukkonen : Online timestamped text indexing. Inf. Process. Lett. 82 (5): 253-259 (2002)

Amihood Amir, Moshe Lewenstein , Ely Porat : Approximate swapped matching. Inf. Process. Lett. 83 (1): 33-39 (2002)

Amihood Amir, Gad M. Landau : Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings Springer 2001

Amihood Amir, Richard Cole , Ramesh Hariharan , Moshe Lewenstein , Ely Porat : Overlap matching. SODA 2001 : 279-288

Amihood Amir, Ely Porat , Moshe Lewenstein : Approximate subset matching with Don't Cares. SODA 2001 : 305-306

Amihood Amir, Reuven Kashi , Nathan S. Netanyahu : Analyzing Quantitative Databases: Image is Everything. VLDB 2001 : 89-98

Jacqueline Yadgari , Amihood Amir, Ron Unger : Genetic Threading. Constraints 6 (2/3): 271-292 (2001)

Amihood Amir, Moshe Lewenstein , Ely Porat : Approximate Swapped Matching. FSTTCS 2000 : 302-311

Amihood Amir, Moshe Lewenstein , Ely Porat : Faster algorithms for string matching with k mismatches. SODA 2000 : 794-803

Amihood Amir, Ayelet Butman , Moshe Lewenstein : Real scaled matching. SODA 2000 : 815-816

Amihood Amir, Gad M. Landau , Dina Sokol : Inplace run-length 2d compressed search. SODA 2000 : 817-818

Amihood Amir, Richard Beigel , William I. Gasarch : Some Connections between Bounded Query Classes and Non-Uniform Complexity Electronic Colloquium on Computational Complexity (ECCC) 7 (24): (2000)

Amihood Amir, Moshe Lewenstein , Noa Lewenstein : Pattern Matching in Hypertext. J. Algorithms 35 (1): 82-99 (2000)

Amihood Amir, Gruia Calinescu : Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36 (1): 34-62 (2000)

Amihood Amir, Yonatan Aumann , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. J. Algorithms 37 (2): 247-266 (2000)

Amihood Amir, Dmitry Keselman , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein , Michael Rodeh : Text Indexing and Dictionary Matching with One Error. J. Algorithms 37 (2): 309-325 (2000)

Gilad Koren , Emanuel Dar , Amihood Amir: The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. SIAM J. Comput. 30 (2): 511-527 (2000)

Amihood Amir, Dmitry Keselman , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein , Michael Rodeh : Indexing and Dictionary Matching with One Error. WADS 1999 : 181-192

S. Uliel , A. Fliess , Amihood Amir, Ron Unger : A simple algorithm for detecting circular permutations in proteins. Bioinformatics 15 (11): 930-936 (1999)

Amihood Amir, Ayelet Butman , Moshe Lewenstein : Real Scaled Matching. Inf. Process. Lett. 70 (4): 185-190 (1999)

Amihood Amir, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Efficient Special Cases of Pattern Matching with Swaps. CPM 1998 : 209-220

Jacqueline Yadgari , Amihood Amir, Ron Unger : Genetic Algorithms for Protein Threading. ISMB 1998 : 193-202

Gilad Koren , Amihood Amir, Emanuel Dar : The Power of Migration in Multi-Processor Scheduling of Real-Time Systems. SODA 1998 : 226-235

Amihood Amir, Gary Benson , Martin Farach : Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144 (1): 1-17 (1998)

Amihood Amir, Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68 (3): 125-132 (1998)

Amihood Amir, Gary Benson : Two-Dimensional Periodicity in Rectangular Arrays. SIAM J. Comput. 27 (1): 90-106 (1998)

Amihood Amir, Emanuel Dar : An Improved Deterministic Algorithms for Generalized Random Sampling. CIAC 1997 : 159-170

Ronen Feldman , Yonatan Aumann , Amihood Amir, Heikki Mannila : Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 : 0-

Amihood Amir, Yonatan Aumann , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein : Pattern Matching with Swaps. FOCS 1997 : 144-153

Ronen Feldman , Yonatan Aumann , Amihood Amir, Amir Zilberstein , Willi Klösgen : Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD 1997 : 167-170

Amihood Amir, Ronen Feldman , Reuven Kashi : A New and Versatile Method for Association Generation. PKDD 1997 : 221-231

Amihood Amir, Moshe Lewenstein , Noa Lewenstein : Pattern Matching In Hypertext. WADS 1997 : 160-173

Amihood Amir, Emanuel Dar : An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. Inf. Process. Lett. 62 (2): 95-101 (1997)

Amihood Amir, Ronen Feldman , Reuven Kashi : A New and Versatile Method for Association Generation. Inf. Syst. 22 (6/7): 333-347 (1997)

Amihood Amir, Alberto Apostolico , Moshe Lewenstein : Inverse Pattern Matching. J. Algorithms 24 (2): 325-339 (1997)

Amihood Amir, Gary Benson , Martin Farach : Optimal Two-Dimensional Compressed Matching. J. Algorithms 24 (2): 354-379 (1997)

Amihood Amir, Dmitry Keselman : Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM J. Comput. 26 (6): 1656-1669 (1997)

Amihood Amir, Gruia Calinescu : Alphabet Independent and Dictionary Scaled Matching. CPM 1996 : 320-334

Amihood Amir, Gary Benson , Martin Farach : Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52 (2): 299-307 (1996)

Amihood Amir, Martin Farach : Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures Inf. Comput. 118 (1): 1-11 (1995)

Amihood Amir, Martin Farach , Ramana M. Idury , Johannes A. La Poutré , Alejandro A. Schäffer : Improved Dynamic Dictionary Matching Inf. Comput. 119 (2): 258-282 (1995)

Dmitry Keselman , Amihood Amir: Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms FOCS 1994 : 758-769

Amihood Amir, Gary Benson , Martin Farach : Optimal Two-Dimensional Compressed Matching. ICALP 1994 : 215-226

Amihood Amir, Gary Benson , Martin Farach : Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994 : 705-714

Amihood Amir, Martin Farach , S. Muthukrishnan : Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49 (3): 111-115 (1994)

Amihood Amir, Martin Farach , Zvi Galil , Raffaele Giancarlo , Kunsoo Park : Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49 (2): 208-222 (1994)

Amihood Amir, Gary Benson , Martin Farach : An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23 (2): 313-323 (1994)

Amihood Amir, Martin Farach , Ramana M. Idury , Johannes A. La Poutré , Alejandro A. Schäffer : Improved Dynamic Dictionary Matching. SODA 1993 : 392-401

Amihood Amir, Gary Benson , Martin Farach : Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993 : 79-85

Amihood Amir, Carl H. Smith : The Syntax of Parallelism. Fundam. Inform. 19 (3/4): 383-402 (1993)

Amihood Amir, Martin Farach , Yossi Matias : Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992 : 262-275

Amihood Amir, Gary Benson : Efficient Two-Dimensional Compressed Matching. Data Compression Conference 1992 : 279-288

Amihood Amir, Gary Benson : Two-Dimensional Periodicity and Its Applications. SODA 1992 : 440-452

Amihood Amir, Gary Benson , Martin Farach : Alphabet Independent Two Dimensional Matching STOC 1992 : 59-68

Amihood Amir, Martin Farach : Two-Dimensional Dictionary Matching. Inf. Process. Lett. 44 (5): 233-239 (1992)

Amihood Amir, Gad M. Landau , Uzi Vishkin : Efficient Pattern Matching with Scaling. J. Algorithms 13 (1): 2-32 (1992)

Amihood Amir, Martin Farach : Adaptive Dictionary Matching FOCS 1991 : 760-766

Amihood Amir, Martin Farach : Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991 : 212-223

Amihood Amir, Martin Farach : Efficient matching of nonrectangular shapes. Ann. Math. Artif. Intell. 4 : 211-224 (1991)

Amihood Amir, Gad M. Landau : Fast Parallel and Serial Multidimensional Aproximate Array Matching. Theor. Comput. Sci. 81 (1): 97-115 (1991)

Amihood Amir, Gad M. Landau , Uzi Vishkin : Efficient Pattern Matching with Scaling. SODA 1990 : 344-357

Amihood Amir, Richard Beigel , William I. Gasarch : Some Connections Between Bounded Query Classes and Non-Uniform Complexity. Structure in Complexity Theory Conference 1990 : 232-243

Amihood Amir, Nick Roussopoulos : Optimal view caching. Inf. Syst. 15 (2): 169-171 (1990)

Amihood Amir, William I. Gasarch : Polynomial Terse Sets Inf. Comput. 77 (1): 37-56 (1988)

Amihood Amir, Dov M. Gabbay : Preservation of Expressive Completeness in Temporal Models Inf. Comput. 72 (1): 66-83 (1987)

Amihood Amir: Expressive Completeness Failure in Branching Time Structures. J. Comput. Syst. Sci. 34 (1): 27-42 (1987)

Amihood Amir: Expressive Completeness Failure in Branching Time Structures. J. Comput. Syst. Sci. 34 (1): 27-42 (1987)

Amihood Amir: Separation in Nonlinear Time Models Information and Control 66 (3): 177-203 (1985)

1 [ 34 ] [ 71 ]

2 [ 39 ] [ 40 ] [ 41 ] [ 54 ] [ 80 ]

3 [ 7 ] [ 57 ] [ 73 ]

4 [ 15 ] [ 16 ] [ 17 ] [ 20 ] [ 22 ] [ 25 ] [ 26 ] [ 30 ] [ 33 ] [ 43 ] [ 45 ]

5 [ 49 ] [ 59 ] [ 75 ] [ 82 ]

6 [ 31 ] [ 55 ]

7 [ 69 ]

8 [ 65 ] [ 74 ] [ 80 ]

9 [ 82 ]

10 [ 36 ] [ 42 ] [ 46 ] [ 52 ] [ 69 ]

11 [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 15 ] [ 18 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 28 ] [ 29 ] [ 30 ] [ 33 ] [ 45 ]

12 [ 35 ] [ 38 ] [ 39 ] [ 41 ]

13 [ 50 ]

14 [ 4 ]

15 [ 23 ]

16 [ 5 ] [ 7 ] [ 57 ] [ 73 ]

17 [ 23 ]

18 [ 65 ] [ 74 ]

19 [ 81 ]

20 [ 21 ] [ 28 ]

21 [ 35 ] [ 38 ] [ 63 ] [ 78 ] [ 79 ]

22 [ 78 ]

23 [ 27 ] [ 32 ] [ 51 ] [ 53 ]

24 [ 39 ]

25 [ 46 ] [ 52 ]

26 [ 8 ] [ 9 ] [ 13 ] [ 40 ] [ 44 ] [ 48 ] [ 51 ] [ 53 ] [ 54 ] [ 58 ] [ 66 ] [ 68 ] [ 70 ] [ 71 ] [ 72 ] [ 76 ] [ 77 ] [ 82 ]

27 [ 34 ] [ 37 ] [ 40 ] [ 44 ] [ 48 ] [ 49 ] [ 51 ] [ 53 ] [ 54 ] [ 56 ] [ 59 ] [ 60 ] [ 61 ] [ 64 ] [ 65 ] [ 67 ] [ 74 ] [ 75 ] [ 76 ] [ 80 ]

28 [ 37 ] [ 40 ] [ 44 ] [ 48 ] [ 51 ] [ 53 ] [ 54 ] [ 56 ]

29 [ 41 ]

30 [ 18 ]

31 [ 81 ]

32 [ 24 ]

33 [ 63 ] [ 78 ] [ 79 ]

34 [ 23 ]

35 [ 60 ] [ 61 ] [ 64 ] [ 65 ] [ 67 ] [ 74 ] [ 75 ] [ 80 ]

36 [ 21 ] [ 28 ]

37 [ 51 ] [ 53 ]

38 [ 6 ]

39 [ 71 ]

40 [ 21 ] [ 28 ]

41 [ 82 ]

42 [ 19 ]

43 [ 58 ] [ 70 ] [ 72 ] [ 76 ] [ 77 ]

44 [ 68 ]

45 [ 50 ]

46 [ 47 ] [ 50 ] [ 62 ] [ 81 ]

47 [ 8 ] [ 13 ]

48 [ 78 ]

49 [ 47 ] [ 62 ]

50 [ 39 ]




©2004 Association for Computing Machinery